Some alternating sums of Lucas numbers

We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.     

一些包含Lucas数的恒等式

利用第一类Chebyshev多项式的性质以及其与Lucas数的关系得到了关于Lucas数立方的一些恒等式.     

Yet another way of calculating moments of the Kesten's distribution and its consequences for Catalan numbers and Catalan triangles

We calculate moments of the so-called Kesten distribution by means of the expansion of the denominator of the density of this distribution and then integrate all summands with respect to the semicircle distribution. By comparing this expression with the formulae for the moments of Kesten's distribution obtained by other means, we find identities involving polynomials whose power coefficients are closely related to Catalan numbers, Catalan triangles, binomial coefficients. Finally, as applications of these identities we obtain various interesting relations between the aforementioned numbers, also concerning Lucas, Fibonacci and Fine numbers.     

关于Lucas三角形猜想的一个结果

运用初等方法,证明k=7时Lucas三角形不存在.     

Symbolic Computation of Newton Sum Rules for the Zeros of Polynomial Eigenfunctions of Linear Differential Operators

A symbolic algorithm based on the generalized Lucas polynomials of first kind is used in order to compute the Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators with polynomial coefficients.     

The Weight Distribution of C 5(1, n)

In [2] the codes C _q (r,n) over were introduced. These linear codes have parameters , can be viewed as analogues of the binary Reed-Muller codes and share several features in common with them. In [2], the weight distribution of C ₃(1,n) is completely determined.In this paper we compute the weight distribution of C ₅(1,n). To this end we transform a sum of a product of two binomial coefficients into an expression involving only exponentials an Lucas numbers. We prove an effective result on the set of Lucas numbers which are powers of two to arrive to the complete determination of the weight distribution of C ₅(1,n). The final result is stated as Theorem 2.     

Elliptic Solutions of Dynamical Lucas Sequences

We study two types of dynamical extensions of Lucas sequences and give elliptic solutions for them. The first type concerns a level-dependent (or discrete time-dependent) version involving commuting variables. We show that a nice solution for this system is given by elliptic numbers. The second type involves a non-commutative version of Lucas sequences which defines the non-commutative (or abstract) Fibonacci polynomials introduced by Johann Cigler. If the non-commuting variables are specialized to be elliptic-commuting variables the abstract Fibonacci polynomials become non-commutative elliptic Fibonacci polynomials. Some properties we derive for these include their explicit expansion in terms of normalized monomials and a non-commutative elliptic Euler–Cassini identity.     

广义Pell方程Ax^2-By^2=4的通解公式

主要运用 Lucas 数的奇偶性,讨论了当 A, B 是适合 A〉1,2-AB 且 AB 非平方数的正整数时,广义 Pell 方程的整数解（x, y）,即给出了方程 Ax^2 -By^2=4适合gcd（x, y）=1的整数解（x, y）的通解公式。     

三项式xn-x-a的二次不可约因式

设n是正整数,f(x)=xn-x-a,其中a是非零整数. 证明了当n>5时,如果f(x)有首项系数为1的二次整系数不可约因式g(x),则必有n≡2(mod6),a=-1,g(x)=x2-x+1或者n=7,a=±280,g(x)=x2t(±)x+5.     

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x ²ⁿ + y ²ⁿ , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.